A Novel Multi-objective Orthogonal Simulated Annealing Algorithm for Solving Multi-objective Optimization Problems with a Large Number of Parameters
نویسندگان
چکیده
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intelligent generation mechanism (MOIGM) is proposed to efficiently solve multi-objective optimization problems with large parameters. Instead of generate-and-test methods, MOIGM makes use of a systematic reasoning ability of orthogonal experimental design to efficiently search for a set of Pareto solutions. It is shown empirically that MOOSA is comparable to some existing population-based algorithms in solving some multi-objective test functions with a large number of parameters.
منابع مشابه
َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
متن کاملA Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations
In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...
متن کاملA Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers
This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...
متن کاملOptimization of Time, Cost, and Quality in Critical Chain Method Using Simulated Annealing (RESEARCH NOTE)
In the last decade, theory of constraint application in project management lead to make a new approach for project scheduling and control as a critical chain. In this paper, a multi-objective optimization model for multi-project scheduling on critical chain is investigated. The objectives include time, cost and quality. In order to solve the problem, a Simulated Annealing algorithm is developed...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کامل